منابع مشابه
Finite canonization
The canonization theorem says that for given m, n for some m (the first one is called ER(n;m)) we have for every function f with domain [1, . . . , m], for some A ∈ [1, . . . , m], the question of when the equality f(i1, . . . , in) = f(j1, . . . , jn) (where i1 < · · · < in and j1 < · · · jn are from A) holds has the simplest answer: for some v ⊆ {1, . . . , n} the equality holds iff ∧
متن کاملThe CARMEN Neuroscience Server
Understanding the brain is one of the major scientific challenges. It requires the capability to synthesize a detailed and applicable understanding of the way in which information is encoded, accessed, analysed, archived and decoded in neuronal networks. Data is difficult and expensive to produce, but is rarely shared and collaboratively exploited. The main reason for this is that a proliferati...
متن کاملUntyped XQuery Canonization
XQuery is a powerful language defined by the W3C to query XML documents. Its query functionalities and its expressiveness satisfy the major needs of both the database community and the text and documents community. As an inconvenient, the grammar used to define XQuery is thus very complex and leads to several equivalent query expressions for one same query. This complexity often discourages XQu...
متن کامل11 Carmen Perez.indd
address correspondence to: Carmen M. Pérez, MHSN, LND, RD, Universidad del Turabo, School of Health Sciences, PO Box 3030 Gurabo, Puerto Rico, 00778-3030. Tel: (787) 743-7979 ext 4062 • Fax: (787) 704-2703 • Email: [email protected] Herbal remedies have been widely used in many countries for centuries, and the products enjoyed a surge in popularity in the USa during the late '90s. During the pas...
متن کاملCompressed Tree Canonization
Straight-line (linear) context-free tree (SLT) grammars have been used to compactly represent ordered trees. Equivalence of SLT grammars is decidable in polynomial time. Here we extend this result and show that isomorphism of unordered trees given as SLT grammars is decidable in polynomial time. The result generalizes to isomorphism of unrooted trees and bisimulation equivalence. For non-linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BOGA: Basque Studies Consortium Journal
سال: 2020
ISSN: 2325-7628
DOI: 10.18122/boga/vol8/iss1/1/boisestate